Improved round Robin Policy a Mathematical Approach
نویسنده
چکیده
This work attempts to mathematically formulize the computation of waiting time of any process in a static n-process, CPU-bound round robin scheme. That in effect, can calculate other performance measures also. An improvement in the existing round robin algorithm has also been worked out that provides priority to processes nearing completion. The suggested approach uses two ready queues, wherein a process is returned to the second ready queue after the completion of its penultimate round. This policy reduces the average waiting time and increases the throughput, in comparison to the conventional round robin scheme, while maintaining the same level of CPU utilization and no substantial increase in the overheads. The mathematical formulation of this policy is transparent enough; it provides, for each process, the actual order of shifting to the second queue and also the order of termination.
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملComparisons of Improved Round Robin Algorithms
Many altered versions of the Round Robin CPU scheduling algorithm have been created to fix the shortcomings of the Standard Round Robin algorithm. When these improved Round Robin algorithms are first created, they are always compared to the Standard Round Robin algorithm to ensure that they provide an improvement over it. Occasionally, they are compared to one other improved Round Robin algorit...
متن کاملSimulation of Several Round-Robin Variants in M/G/1 queues
The concept of processor sharing introduces a heuristics to prevent long jobs from blocking short jobs in queue. In practice, round-robin has to be used. In the literature, it is generally assumed that newly arrived jobs are put at the end of the queue. However, for highly varying job demands, such an approach may perform poorly. By favoring newly arrived jobs, which are more likely to be short...
متن کاملThe Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems
− Dynamic load sharing policies have been extensively studied. Most of the previous studies have assumed a homogeneous distributed system with a first-come-first-served (FCFS) node scheduling policy. In addition, job service times and inter-arrival times are assumed to be exponentially distributed. In this paper, we study the impact of these assumptions on the performance of sender-initiated an...
متن کاملIntelligent Packet Discard Policies for Improved Tcp Queue Management
Recent studies have shown that suitably-designed packet discard policies can dramatically improve the performance of fair queueing mechanisms in internet routers. The Queue State Deficit Round Robin algorithm (QSDRR) preferentially discards from long queues, but introduces hysteresis into the discard policy to minimize synchronization among TCP flows. QSDRR provides higher throughput and much b...
متن کامل